Logarithmic concavity for edge lattices of graphs
نویسندگان
چکیده
منابع مشابه
Logarithmic Concavity and SI2(C)
We observe that for any logarithmically concave nite sequence a 0 , a 1 , : : : , a n of positive integers there is a representation of the Lie algebra sl 2 (C) from which this logarithmic concav-ity follows. Thus, in applying this strategy to prove logarithmic concavity, the only issue is to construct such a representation naturally from given combinatorial data. As an example, we do this when...
متن کاملh-Vectors of matroids and logarithmic concavity
Article history: Received 11 November 2012 Accepted 4 November 2014 Available online 13 November 2014 Communicated by Ezra Miller MSC: 05B35 52C35
متن کاملTransitive Edge Coloring of Graphs and Dimension of Lattices
We explore properties of edge colorings of graphs defined by set intersections. An edge coloring of a graphG with vertex set V ={1,2, . . . ,n} is called transitive if one can associate sets F1,F2, . . . ,Fn to vertices of G so that for any two edges ij,kl∈E(G), the color of ij and kl is the same if and only if Fi∩Fj =Fk∩Fl. The term transitive refers to a natural partial order on the color set...
متن کاملEdge-coloring Vertex-weightings of Graphs
Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $n$. A $k$-vertex weightings of a graph $G$ is a mapping $w: V(G) to {1, ldots, k}$. A $k$-vertex weighting induces an edge labeling $f_w: E(G) to N$ such that $f_w(uv)=w(u)+w(v)$. Such a labeling is called an {it edge-coloring k-vertex weightings} if $f_{w}(e)not= f_{w}(echr(chr(chr('39')39chr('39'))39chr(chr('39')39chr('39'...
متن کاملProduct of normal edge-transitive Cayley graphs
For two normal edge-transitive Cayley graphs on groups H and K which have no common direct factor and $gcd(|H/H^prime|,|Z(K)|)=1=gcd(|K/K^prime|,|Z(H)|)$, we consider four standard products of them and it is proved that only tensor product of factors can be normal edge-transitive.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1975
ISSN: 0097-3165
DOI: 10.1016/0097-3165(75)90064-3